Multicriteria Semi-Obnoxious Network Location Problems (MSNLP) with Sum and Center Objectives
نویسندگان
چکیده
Locating a facility is often modeled as either the maxisum or the minisum problem, re ecting whether the facility is undesirable (obnoxious) or desirable. But many facilities are both desirable and undesirable at the same time, e.g. an airport. This can be modeled as a multicriteria network location problem, where some of the sumobjectives are maximized (push e ect) and some of the sum-objectives are minimized (pull e ect). We present a polynomial time algorithm for this model along with some basic theoretical results, and generalize the results also to incorporate maximin and minimax objectives. In fact, the method works for any piecewise linear objective functions. Finally, we present some computational results.
منابع مشابه
An efficient algorithm for finding the semi-obnoxious $(k,l)$-core of a tree
In this paper we study finding the $(k,l)$-core problem on a tree which the vertices have positive or negative weights. Let $T=(V,E)$ be a tree. The $(k,l)$-core of $T$ is a subtree with at most $k$ leaves and with a diameter of at most $l$ which the sum of the weighted distances from all vertices to this subtree is minimized. We show that, when the sum of the weights of vertices is negative, t...
متن کاملStrategy-Proof Mechanism for Obnoxious Facility Location on a Line
In the problem of obnoxious facility location, an obnoxious facility is located in an area. To maximize the social welfare, e.g., the sum of distances from all the agents to the facility, we have to get the true locations of each agent. However, each agent may misreport his/her location to stay far away from the obnoxious facility. In this paper, we design strategy-proof mechanisms on locating ...
متن کاملMulticriteria network location problems with sum objectives
In this paper network location problems with several objectives are discussed, where every single objective is a classical median objective function. We will look at the problem of nding Pareto optimal locations and lexicographically optimal locations. It is shown that for Pareto optimal locations in undirected networks no node dominance result can be shown. Structural results as well as eecien...
متن کاملLocating a Semi-Obnoxious Facility on a Network with the Elliptic Maximin and Network Minisum Objectives
متن کامل
Algorithm for Obnoxious Facility Location Problem
This study presents an endeavor to determine an optimal solution for the obnoxious facility location problem. Obnoxious materials are those which may cause harm to the health of human beings and pollute the environment. The obnoxious material management is a significant environmental issue. Since the social economical growth encourages to establishment of industrialization. While the waste mate...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Annals OR
دوره 110 شماره
صفحات -
تاریخ انتشار 2002